Secure Computation-and-Forward With Linear Codes
نویسندگان
چکیده
We discuss secure transmission via an untrusted relay when we have a multiple access phase from two nodes to the and broadcast nodes. To realize security, construct code that securely transmits modulo sum of messages channel. In this code, cannot obtain any information with respect message each node, can decode only modulo-sum Our is constructed by simple combination existing linear universal2 hash function.
منابع مشابه
Computation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملSecure Computation from Random Error Correcting Codes
Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure computation is that security is maintained even in the presence of an adversary who corrupts a quorum of the processors and who exercises full, malicious control over them. One of the fundamental primitives at the heart of secure...
متن کاملNear-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
In the setting of unconditionally-secure MPC, where dishonest players are unbounded and no cryptographic assumptions are used, it was known since the 1980’s that an honest majority of players is both necessary and sufficient to achieve privacy and correctness, assuming secure point-to-point and broadcast channels. The main open question that was left is to establish the exact communication comp...
متن کاملUnconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity
We present two unconditionally secure asynchronous multiparty computation (AMPC) protocols among nparties with an amortized communication complexity of O(n) field elements per multiplication gate and whichcan tolerate a computationally unbounded active adversary corrupting t < n/4 parties. These are the first AMPCprotocols with linear communication complexity per multiplication gate...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE journal on selected areas in information theory
سال: 2021
ISSN: ['2641-8770']
DOI: https://doi.org/10.1109/jsait.2021.3054581